Game Review

Game Review

Math 121 — Game Theory Review

1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and Main Ideas 7 3. Techniques 8 3.1. Tips to remember when solving 2-player 0-sum games: 8 3.2. Solving for mixed strategies in 2-player 0-sum games: 8 3.3. Finding equilibrium pairs in 2-person nonzero-sum games 9 3.4. Finding the Nash maximin bar...

Challenges of Online Game Development: A Review

The focus of this article is to determine how the engineering practices common in online game development may be approached differently to promote more diverse online gaming scenarios. The technical difficulties in providing online gaming are not trivial, requiring substantially larger budgets compared with their non-online counterparts: Commercial failure of an online game could be costly. The...

A Review of Game-Tree Pruning

Chess programs have three major components: move generation, search, and evaluation. All components are important, although evaluation with its quiescence analysis is the part which makes each program’s play unique. The speed of a chess program is a function of its move generation cost, the complexity of the position under study and the brevity of its evaluation. More important, however, is the...

Game-theoretic Network Centrality: A Review

Game-theoretic centrality is a flexible and sophisticated approach to identify the most important nodes in a network. It builds upon the methods from cooperative game theory and network theory. The key idea is to treat nodes as players in a cooperative game, where the value of each coalition is determined by certain graph-theoretic properties. Using solution concepts from cooperative game theor...